On the multiresource flexible job‐shop scheduling problem with arbitrary precedence graphs

This paper aims at linking the work presented in Dauzère-Pérès et al. (1998) and more recently Kasapidis (2021) on multiresource flexible job-shop scheduling problem with nonlinear routes or equivalently arbitrary precedence graphs. In particular, we present a mixed integer linear programming (MIP) model constraint (CP) to formulate problem. We also compare theorems introduced propose new theorem extension. Computational experiments were conducted assess efficiency effectiveness of all propositions. Lastly, proposed MIP CP models are tested benchmark problems literature comparisons made state-of-the-art algorithms.